Locating battery charging stations to facilitate almost shortest paths
نویسندگان
چکیده
منابع مشابه
Locating Battery Charging Stations to Facilitate Almost Shortest Paths
We study a facility location problem motivated by requirements pertaining to the distribution of charging stations for electric vehicles: Place a minimum number of battery charging stations at a subset of nodes of a network, so that battery-powered electric vehicles will be able to move between destinations using “t-spanning” routes, of lengths within a factor t > 1 of the length of a shortest ...
متن کاملAll Pairs Almost Shortest Paths
Let G = (V;E) be an unweighted undirected graph on n vertices. A simple argument shows that computing all distances in G with an additive one-sided error of at most 1 is as hard as Boolean matrix multiplication. Building on recent work of Aingworth, Chekuri and Motwani, we describe an ~ O(minfn3=2m1=2; n7=3g) time algorithmAPASP2 for computing all distances in G with an additive one-sided error...
متن کاملShortest paths in almost acyclic graphs
This paper presents an algorithm for the shortest-path problem on a directed graph having arbitrary arc weights. One feature of the algorithm is its ability to exploit a certain type of structure. Two examples of this feature are highlighted. The rst example is when the given graph is “almost” acyclic in the sense that there exists a small subset T of nodes, the deletion of which yields an acyc...
متن کاملOptimal Charging Operation of Battery Swapping and Charging Stations with QoS Guarantee
Motivated by the urgent demand for the electric vehicle (EV) fast refueling technologies, battery swapping and charging stations (BSCSs) are envisioned as a promising solution to provide timely EV refueling services. However, inappropriate battery charging operation in BSCSs can not only incur unnecessary high charging cost but also threaten the reliability of the power grid. In this paper, we ...
متن کاملShortest paths between shortest paths
We study the following problem on recon guring shortest paths in graphs: Given two shortest st paths, what is the minimum number of steps required to transform one into the other, where each intermediate path must also be a shortest s-t path and must di er from the previous one by only one vertex. We prove that the shortest recon guration sequence can be exponential in the size of the graph and...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Discrete Applied Mathematics
سال: 2019
ISSN: 0166-218X
DOI: 10.1016/j.dam.2018.07.019